#define _CRT_SECURE_NO_WARNINGS 1

class Solution {
public:
    int searchInsert(vector<int>& nums, int target)
    {
        int left = 0;
        int right = nums.size() - 1;
        int mid = 0;

        if (nums[nums.size() - 1] < target)
        {
            return nums.size();
        }

        while (left < right)
        {
            mid = left + (right - left) / 2;

            if (nums[mid] >= target)right = mid;
            else left = mid + 1;
        }

        return left;
    }
};